Constructing signed strongly regular graphs via star complement technique

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular Star Complements in Strongly Regular Graphs

We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are only finitely many connected strongly regular graphs with a regular star complement of prescribed degree s ∈ IN . We investigate the possible parameters when s ≤ 5. AMS Classification: 05C50

متن کامل

Regular matroid decomposition via signed graphs

The key to Seymour’s Regular Matroid Decomposition Theorem is his result that each 3-connected regular matroid with no R10or R12-minor is graphic or cographic. We present a proof of this in terms of signed graphs. 2004 Wiley Periodicals, Inc. J Graph Theory 48: 74–84, 2005

متن کامل

Signed line graphs with least eigenvalue -2: The star complement technique

Let G be a connected graph with least eigenvalue −2, of multiplicity k. A star complement for −2 in G is an induced subgraph H = G − X such that |X | = k and −2 is not an eigenvalue of H . In the case that G is a generalized line graph, a characterization of such subgraphs is used to decribe the eigenspace of −2. In some instances, G itself can be characterized by a star complement. If G is not...

متن کامل

Co-cliques and star complements in extremal strongly regular graphs

Suppose that the positive integerμ is the eigenvalue of largest multiplicity in an extremal strongly regular graph G. By interlacing, the independence number of G is at most 4μ2 + 4μ− 2. Star complements are used to show that if this bound is attained then either (a) μ = 1 and G is the Schläfli graph or (b) μ = 2 and G is the McLaughlin graph. © 2006 Elsevier Inc. All rights reserved. AMS class...

متن کامل

On co-regular signed graphs

A graph whose edges are labeled either as positive or negative is called a signed graph. A signed graph is said to be net-regular if every vertex has constant net-degree k, namely, the difference between the number of positive and negative edges incident with a vertex. In this paper, we analyze some properties of co-regular signed graphs which are net-regular signed graphs with the underlying g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Sciences

سال: 2018

ISSN: 2008-1359,2251-7456

DOI: 10.1007/s40096-018-0254-4